A Differential Semantics of Lazy AR Propagation
نویسنده
چکیده
In this paper we present a differential semantics of Lazy AR Propagation (LARP) in discrete Bayesian networks. We describe how both single and multi dimensional partial derivatives of the evidence may easily be calculated from a junction tree in LARP equilibrium. We show that the simplicity of the calculations stems from the nature of LARP. Based on the differential semantics we describe how variable propagation in the LARP architecture may give access to additional partial derivatives. The cautious LARP (cLARP) scheme is derived to produce a flexible cLARP equilibrium that offers additional opportunities for calculating single and multi dimensional partial derivatives of the evidence and subsets of the evidence from a single propagation. The results of an empirical evaluation illustrates how the access to a largely increased number of partial derivatives comes at a low computational cost.
منابع مشابه
An Empirical Evaluation of Possible Variations of Lazy Propagation
As real-world Bayesian networks continue to grow larger and more complex, it is important to investigate the possibilities for improving the performance of existing algorithms of probabilistic inference. Motivated by examples, we investigate the dependency of the performance of Lazy propagation on the message computation algorithm. We show how Symbolic Probabilistic Inference (SPI) and Arc-Reve...
متن کاملA new framework for strictness analysis using abstract demand propagation
This paper presents a novel approach to strictness analysis called abstract demand propagation, approach developed for the implementation of lazy functional programming languages on parallel machines. Although some work on strictness analysis using demand propagation has been done before, the present work is original in that it gives a precise interpretation of the notions of demands and demand...
متن کاملNew Methods for Marginalization in Lazy Propagation
Even though existing algorithms for belief update in Bayesian networks (BNs) have exponential time and space complexity, belief update in many real-world BNs is feasible. However, in some cases the efficiency of belief update may be insufficient. In such cases minor improvements in efficiency may be important or even necessary to make a task tractable. This paper introduces two improvements to ...
متن کاملBuddy System: Available, Consistent, Durable Web Service Transactions
In this paper we investigate the problem of providing consistency, availability and durability for web service transactions. We propose an approach that matches the availability of the popular lazy replica update propagation method while increases the durability and consistency. Our replica update propagation method is called the Buddy System, which requires that updates are preserved synchrono...
متن کاملSolving CLQG Influence Diagrams Using Arc-Reversal Operations in a Strong Junction Tree
This paper presents an architecture for solving conditional linear-quadratic Gaussian (CLQG) influence diagrams (IDs) by Lazy Propagation (LP). A strong junction tree (SJT) is used to guide the elimination order whereas the marginalization operation is based on arc-reversal (AR). The use of AR for marginalization simplifies the implementation and gives the architecture a number of advantages. T...
متن کامل